منابع مشابه
Strategies for Repeated Games with Subsystem Takeovers
Systems of selfish-computers, such as the Internet, are subject to transient faults due to hardware/software temporal malfunctions; just as the society is subjected to human mistakes due to a moment of weakness. Game theory uses punishment for deterring improper behavior. Due to faults, selfish-computers may punish well-behaved ones. This is one of the key motivations for forgiveness that follo...
متن کاملK-Memory Strategies in Repeated Games
In this paper, we study k-memory strategies in two-person repeated games. An agent adopting such a strategy makes his decision only based on the action profiles of the previous k rounds. We show that in finitely repeated games, the best response of a k-memory strategy may not even be a constant-memory strategy. However, in infinitely repeated games, one of the best responses against any given k...
متن کاملZero-determinant strategies in finitely repeated games.
Direct reciprocity is a mechanism for sustaining mutual cooperation in repeated social dilemma games, where a player would keep cooperation to avoid being retaliated by a co-player in the future. So-called zero-determinant (ZD) strategies enable a player to unilaterally set a linear relationship between the player's own payoff and the co-player's payoff regardless of the strategy of the co-play...
متن کاملZero-Determinant Strategies in Noisy Repeated Games
Press and Dyson has recently revealed a new set of “zero-determinant” (ZD) strategies for repeated games, which grant a player with power of manipulation on the game’s payoffs. A ZD strategy player can unilaterally enforce a fixed linear relationship between his payoff and that of his opponent. In particular it can (i) deterministically set his opponent’s payoff to a fixed value, regardless of ...
متن کاملRepeated Games with Stationary Bounded Recall Strategies
A great deal of attention has been paid recently to repeated games with bounded complexity. References [3, 5, 63 and others deal with repeated games played by automata. In this case the set of strategies is reduced to the set of those strategies that can be realized by automata. Here we address ourselves to repeated games played by players with bounded recall who do not know the stage in which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 1981
ISSN: 0001-8678,1475-6064
DOI: 10.1017/s0001867800036090